Reachability is Decidable for Ground AC Rewrite Systems
نویسنده
چکیده
The reachability problem for ground associative-commutative (AC) rewrite systems is decidable. We show that ground AC rewrite systems are equivalent to Process Rewrite Systems (PRS) for which reach-ability is decidable 4]. However, the decidability proofs for PRS are cumbersome and thus we present a simpler and more readable proof in the framework of ground AC rewrite systems. Moreover, we show decidability of reachability of states with certain properties and de-cidability of the boundedness problem.
منابع مشابه
Rewriting in the partial algebra of typed terms modulo AC
We study the partial algebra of typed terms with an associative commutative and idempotent operator (typed AC-terms). The originality lies in the representation of the typing policy by a graph which has a decidable monadic theory. In this paper we show on two examples that some results on AC-terms can be raised to the level of typed AC-terms. The examples are the results on rational languages (...
متن کاملTermination of Rewrite Systems with Shallow Right-Linear, Collapsing, and Right-Ground Rules
We show that termination is decidable for rewrite systems that contain shallow and right-linear rules, collapsing rules, and rightground rules. This class of rewrite systems is expressive enough to include interesting rules. Our proof uses the fact that this class of rewrite systems is known to be regularity-preserving and hence the reachability and joinability problems are decidable. Decidabil...
متن کاملConfluence of Shallow Right-Linear Rewrite Systems
We show that confluence of shallow and right-linear term rewriting systems is decidable. This class of rewriting system is expressive enough to include nontrivial nonground rules such as commutativity, identity, and idempotence. Our proof uses the fact that this class of rewrite systems is known to be regularity-preserving, which implies that its reachability and joinability problems are decida...
متن کاملUniqueness of Normal Forms is Decidable for Shallow Term Rewrite Systems
Uniqueness of normal forms (UN=) is an important property of term rewrite systems. UN= is decidable for ground (i.e., variable-free) systems and undecidable in general. Recently it was shown to be decidable for linear, shallow systems. We generalize this previous result and show that this property is decidable for shallow rewrite systems, in contrast to confluence, reachability and other proper...
متن کاملDeciding Fundamental Properties of Right-(Ground or Variable) Rewrite Systems by Rewrite Closure
Right-(ground or variable) rewrite systems (RGV systems for short) are term rewrite systems where all right hand sides of rules are restricted to be either ground or a variable. We define a minimal rewrite extensionR of the rewrite relation induced by a RGV system R. This extension admits a rewrite closure presentation, which can be effectively constructed from R. The rewrite closure is used to...
متن کامل